Some More Results on Reciprocal Degree Distance Index and <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <mi mathvariant="normal">ℱ</mi> </math>-Sum Graphs
نویسندگان
چکیده
A chemical invariant of graphical structure Z is a unique value characteristic that remains unchanged under graph automorphisms. In the study QSAR/QSPR, like many other invariants, reciprocal degree distance has played significant role to estimate bioactivity several compounds in chemistry. Reciprocal invariant, which weighted version Harary index, i.e., id="M3"> mathvariant="normal">ℛ mathvariant="script">D = 1 / 2 ∑ μ , ν ∈ mathvariant="script">V ( d + ) . Eliasi and Taeri proposed four new graphic unary operations: id="M4"> mathvariant="script">S mathvariant="script">Q , id="M5"> mathvariant="script">T frequently implemented sum graphs, symbolized as id="M6"> mathvariant="normal">ℱ two graphs id="M7"> id="M8"> ; one operations id="M9"> This work provides constraints for above-mentioned this binary operation F-sum graphs.
منابع مشابه
Some results on the reciprocal sum-degree distance of graphs
In this contribution, we first investigate sharp bounds for the reciprocal sum-degree distance of graphs with a given matching number. The corresponding extremal graphs are characterized completely. Then we explore the k-decomposition for the reciprocal sum-degree distance. Finally,we establish formulas for the reciprocal sum-degree distance of join and the Cartesian product of graphs.
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملreciprocal degree distance of grassmann graphs
recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.
متن کاملreciprocal degree distance of some graph operations
the reciprocal degree distance (rdd), defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances, that is, $rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u) + d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index, just as the degree distance is a weight version of the wiener index. in this paper, we present exact formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2022
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2022/3178497